Eigenvalues of symmetric integer matrices
نویسندگان
چکیده
منابع مشابه
Extreme eigenvalues of real symmetric Toeplitz matrices
We exploit the even and odd spectrum of real symmetric Toeplitz matrices for the computation of their extreme eigenvalues, which are obtained as the solutions of spectral, or secular, equations. We also present a concise convergence analysis for a method to solve these spectral equations, along with an efficient stopping rule, an error analysis, and extensive numerical results.
متن کاملEigenvalues of symmetric tridiagonal interval matrices revisited
In this short note, we present a novel method for computing exact lower and upper bounds of a symmetric tridiagonal interval matrix. Compared to the known methods, our approach is fast, simple to present and to implement, and avoids any assumptions Our construction explicitly yields those matrices for which particular lower and upper bounds are attained.
متن کاملAlmost All Integer Matrices Have No Integer Eigenvalues
In a recent issue of this MONTHLY, Hetzel, Liew, and Morrison [4] pose a rather natural question: what is the probability that a random n× n integer matrix is diagonalizable over the field of rational numbers? Since there is no uniform probability distribution on Z, we need to exercise some care in interpreting this question. Specifically, for an integer k ≥ 1, let Ik = {−k,−k + 1, . . . , k − ...
متن کاملReal symmetric matrices 1 Eigenvalues and eigenvectors
A matrix D is diagonal if all its off-diagonal entries are zero. If D is diagonal, then its eigenvalues are the diagonal entries, and the characteristic polynomial of D is fD(x) = ∏i=1(x−dii), where dii is the (i, i) diagonal entry of D. A matrix A is diagonalisable if there is an invertible matrix Q such that QAQ−1 is diagonal. Note that A and QAQ−1 always have the same eigenvalues and the sam...
متن کاملOn the concentration of eigenvalues of random symmetric matrices
It is shown that for every 1 ≤ s ≤ n, the probability that the s-th largest eigenvalue of a random symmetric n-by-n matrix with independent random entries of absolute value at most 1 deviates from its median by more than t is at most 4e−t 2/32s2 . The main ingredient in the proof is Talagrand’s Inequality for concentration of measure in product spaces.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 1992
ISSN: 0022-314X
DOI: 10.1016/0022-314x(92)90094-6